________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:22:15
Input Data from:  dataset117.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,059
Average f[i]   :4350
Average g[i,j] :1931,25
Total demand   :11100
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 9
> Selected Move:	0	1	-1	2	5000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 8
> Selected Move:	200	1	-1	3	11000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0    >new incumb.: 200


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 31
> Selected Move:	670	1	-1	4	15000


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  0    >new incumb.: 670


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 20
> Selected Move:	1200	1	-1	6	19500


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  0    >new incumb.: 1200


> New S[]: 
	
	 0  0  0  1  1  0  1  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 19
> Selected Move:	1380	3	2	7	19500


> New Y[]: 
	
	 2  3  0  1  1  0  1  1  0  0    >new incumb.: 1380


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 21
> Selected Move:	1530	3	3	5	19500


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  0    >new incumb.: 1530


> New S[]: 
	
	 0  0  0  0  1  0  1  1  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 18
> Selected Move:	1480	3	5	8	20000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  1  1  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 21
> Selected Move:	1320	3	8	9	20000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 25
> Selected Move:	1200	3	9	2	18500


> New Y[]: 
	
	 2  3  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  1  1  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 19
> Selected Move:	1200	3	6	5	20000


> New Y[]: 
	
	 2  3  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 22
> Selected Move:	1200	3	7	6	19500


> New Y[]: 
	
	 2  3  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 17
> Selected Move:	1292	3	2	3	20500


> New Y[]: 
	
	 2  3  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  1  0  1  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 11
> Selected Move:	1220	4	0	3	16000


> New Y[]: 
	
	 0  3  0  2  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 23
> Selected Move:	1220	4	3	4	18300


> New Y[]: 
	
	 0  3  0  1  2  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 20
> Selected Move:	1220	4	4	5	16400


> New Y[]: 
	
	 0  3  0  1  1  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 21
> Selected Move:	1220	4	5	6	17500


> New Y[]: 
	
	 0  3  0  1  1  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 21
> Selected Move:	1220	3	4	9	20000


> New Y[]: 
	
	 0  3  0  1  0  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 18
> Selected Move:	1220	4	6	3	18500


> New Y[]: 
	
	 0  3  0  2  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 18
> Selected Move:	1220	4	3	5	18900


> New Y[]: 
	
	 0  3  0  1  0  2  1  0  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 15
> Selected Move:	1220	4	5	9	18400


> New Y[]: 
	
	 0  3  0  1  0  1  1  0  0  2 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 20
> Selected Move:	1200	3	3	7	17400


> New Y[]: 
	
	 0  3  0  0  0  1  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 20
> Selected Move:	1200	4	9	5	17900


> New Y[]: 
	
	 0  3  0  0  0  2  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 17
> Selected Move:	1200	4	5	6	19000


> New Y[]: 
	
	 0  3  0  0  0  1  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 14
> Selected Move:	1200	4	6	7	19100


> New Y[]: 
	
	 0  3  0  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 21
> Selected Move:	1200	3	9	4	16600


> New Y[]: 
	
	 0  3  0  0  1  1  1  2  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 20
> Selected Move:	1200	4	7	4	17300


> New Y[]: 
	
	 0  3  0  0  2  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 19
> Selected Move:	1200	4	4	5	15400


> New Y[]: 
	
	 0  3  0  0  1  2  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 22
> Selected Move:	1200	4	5	6	16500


> New Y[]: 
	
	 0  3  0  0  1  1  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 25
> Selected Move:	1080	3	7	8	18000


> New Y[]: 
	
	 0  3  0  0  1  1  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 24
> Selected Move:	1080	4	6	4	18800


> New Y[]: 
	
	 0  3  0  0  2  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 22
> Selected Move:	1080	4	4	5	16900


> New Y[]: 
	
	 0  3  0  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 25
> Selected Move:	1080	4	5	8	16700


> New Y[]: 
	
	 0  3  0  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 25
> Selected Move:	1080	3	4	9	19200


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 20
> Selected Move:	1080	4	8	5	19400


> New Y[]: 
	
	 0  3  0  0  0  2  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 19
> Selected Move:	1080	4	5	9	18900


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 22
> Selected Move:	1000	3	9	0	17000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  1  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 16
> Selected Move:	1130	1	-1	4	21000


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 13
> Selected Move:	1200	3	5	2	20000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  1  0  1  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 20
> Selected Move:	1140	3	2	3	21000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  1  0  1  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 19
> Selected Move:	1005	3	8	9	21000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 22
> Selected Move:	1000	2	4	-1	17000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 16
> Selected Move:	1220	3	1	5	19400


> New Y[]: 
	
	 2  0  0  1  0  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 19
> Selected Move:	1220	4	5	3	19400


> New Y[]: 
	
	 2  0  0  3  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 18
> Selected Move:	1220	4	3	9	18100


> New Y[]: 
	
	 2  0  0  1  0  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 22
> Selected Move:	1220	3	9	4	18300


> New Y[]: 
	
	 2  0  0  1  3  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 20
> Selected Move:	1220	4	4	3	16900


> New Y[]: 
	
	 2  0  0  3  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 23
> Selected Move:	1220	4	3	5	16900


> New Y[]: 
	
	 2  0  0  1  1  3  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 22
> Selected Move:	1220	4	5	6	18100


> New Y[]: 
	
	 2  0  0  1  1  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 22
> Selected Move:	1200	3	3	7	17100


> New Y[]: 
	
	 2  0  0  0  1  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 23
> Selected Move:	1200	4	6	4	17300


> New Y[]: 
	
	 2  0  0  0  3  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 22
> Selected Move:	1200	4	4	5	15900


> New Y[]: 
	
	 2  0  0  0  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 23
> Selected Move:	1200	4	5	7	16000


> New Y[]: 
	
	 2  0  0  0  1  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 24
> Selected Move:	1200	3	4	9	18500


> New Y[]: 
	
	 2  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 18
> Selected Move:	1200	4	7	5	18400


> New Y[]: 
	
	 2  0  0  0  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 17
> Selected Move:	1200	4	5	6	19600


> New Y[]: 
	
	 2  0  0  0  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 15
> Selected Move:	1200	4	6	9	17100


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 24
> Selected Move:	1080	3	7	8	18600


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 25
> Selected Move:	1080	4	9	5	19900


> New Y[]: 
	
	 2  0  0  0  0  3  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 21
> Selected Move:	1080	4	5	8	19300


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 25
> Selected Move:	1080	3	9	4	16800


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 27
> Selected Move:	1080	4	8	4	18800


> New Y[]: 
	
	 2  0  0  0  3  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 24
> Selected Move:	1080	4	4	5	17400


> New Y[]: 
	
	 2  0  0  0  1  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 25
> Selected Move:	1080	4	5	6	18600


> New Y[]: 
	
	 2  0  0  0  1  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 27
> Selected Move:	1000	3	6	1	16500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  1  0 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 21
> Selected Move:	1165	1	-1	7	21500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 26
> Selected Move:	1155	3	8	3	21000


> New Y[]: 
	
	 2  3  0  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,2

## ITERATION 66 #######################


> Neighbours evaluated; 25
> Selected Move:	1060	3	4	6	21500


> New Y[]: 
	
	 2  3  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 67 #######################


> Neighbours evaluated; 23
> Selected Move:	1140	3	3	9	22000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  1  0  1 
 > pw :0,19

## ITERATION 68 #######################


> Neighbours evaluated; 16
> Selected Move:	1130	3	7	4	21000


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 69 #######################


> Neighbours evaluated; 24
> Selected Move:	1028	3	6	7	21500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,2

## ITERATION 70 #######################


> Neighbours evaluated; 25
> Selected Move:	1020	3	5	3	21500


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 71 #######################


> Neighbours evaluated; 30
> Selected Move:	970	3	4	6	22000


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,21

## ITERATION 72 #######################


> Neighbours evaluated; 24
> Selected Move:	1000	2	3	-1	16000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  1  0  1 
 > pw :0,215

## ITERATION 73 #######################


> Neighbours evaluated; 20
> Selected Move:	1000	3	6	5	17500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  1 
 > pw :0,22

## ITERATION 74 #######################


> Neighbours evaluated; 21
> Selected Move:	1000	3	7	3	18500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  1 
 > pw :0,225

## ITERATION 75 #######################


> Neighbours evaluated; 16
> Selected Move:	1085	3	1	6	20600


> New Y[]: 
	
	 2  0  0  1  0  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,23

## ITERATION 76 #######################


> Neighbours evaluated; 25
> Selected Move:	827	3	3	8	21100


> New Y[]: 
	
	 2  0  0  0  0  1  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,235

## ITERATION 77 #######################


> Neighbours evaluated; 20
> Selected Move:	1000	3	6	1	19000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  1 
 > pw :0,24

## ITERATION 78 #######################


> Neighbours evaluated; 19
> Selected Move:	1000	3	5	6	17500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  1 
 > pw :0,245

## ITERATION 79 #######################


> Neighbours evaluated; 24
> Selected Move:	1000	3	8	5	17000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  1 
 > pw :0,24

## ITERATION 80 #######################


> Neighbours evaluated; 17
> Selected Move:	1000	3	9	3	16500


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  1  0  0  0 
 > pw :0,235

## ITERATION 81 #######################


> Neighbours evaluated; 15
> Selected Move:	1000	3	3	4	14500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,23

## ITERATION 82 #######################


> Neighbours evaluated; 13
> Selected Move:	1000	3	4	7	15500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  1  0  0 
 > pw :0,225

## ITERATION 83 #######################


> Neighbours evaluated; 17
> Selected Move:	1088	1	-1	2	20500


> New Y[]: 
	
	 2  3  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  1  0  0 
 > pw :0,22

## ITERATION 84 #######################


> Neighbours evaluated; 19
> Selected Move:	1040	3	2	8	22000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 85 #######################


> Neighbours evaluated; 21
> Selected Move:	943	3	5	9	22500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  1  0  1 
 > pw :0,21

## ITERATION 86 #######################


> Neighbours evaluated; 22
> Selected Move:	990	3	8	2	21000


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  1  0  1 
 > pw :0,205

## ITERATION 87 #######################


> Neighbours evaluated; 24
> Selected Move:	920	3	7	4	20000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,2

## ITERATION 88 #######################


> Neighbours evaluated; 23
> Selected Move:	900	3	2	8	21500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,205

## ITERATION 89 #######################


> Neighbours evaluated; 27
> Selected Move:	1000	2	9	-1	15000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  1  0  1  0 
 > pw :0,21

## ITERATION 90 #######################


> Neighbours evaluated; 24
> Selected Move:	1000	3	8	3	14500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  1  0  1  0  0  0 
 > pw :0,215

## ITERATION 91 #######################


> Neighbours evaluated; 17
> Selected Move:	1000	3	3	7	13500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  1  1  0  0 
 > pw :0,22

## ITERATION 92 #######################


> Neighbours evaluated; 21
> Selected Move:	1000	3	6	5	15000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,225

## ITERATION 93 #######################


> Neighbours evaluated; 24
> Selected Move:	1000	3	7	3	16000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  1  1  0  0  0  0 
 > pw :0,22

## ITERATION 94 #######################


> Neighbours evaluated; 29
> Selected Move:	980	1	-1	2	21000


> New Y[]: 
	
	 2  3  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  1  1  0  0  0  0 
 > pw :0,215

## ITERATION 95 #######################


> Neighbours evaluated; 22
> Selected Move:	943	3	2	8	22500


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  1  1  0  0  0  0 
 > pw :0,21

## ITERATION 96 #######################


> Neighbours evaluated; 22
> Selected Move:	950	4	0	3	18000


> New Y[]: 
	
	 0  3  0  2  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,205

## ITERATION 97 #######################


> Neighbours evaluated; 28
> Selected Move:	1038	1	-1	6	22500


> New Y[]: 
	
	 0  3  0  2  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,2

## ITERATION 98 #######################


> Neighbours evaluated; 27
> Selected Move:	1160	3	8	7	21000


> New Y[]: 
	
	 0  3  0  2  1  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,195

## ITERATION 99 #######################


> Neighbours evaluated; 30
> Selected Move:	1149	3	3	8	21700


> New Y[]: 
	
	 0  3  0  0  1  1  1  1  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,2

## ITERATION 100 #######################


> Neighbours evaluated; 29
> Selected Move:	1120	3	8	2	21100


> New Y[]: 
	
	 0  3  2  0  1  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,205

## ITERATION 101 #######################


> Neighbours evaluated; 15
> Selected Move:	1258	4	2	5	20400


> New Y[]: 
	
	 0  3  1  0  1  2  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,21

## ITERATION 102 #######################


> Neighbours evaluated; 25
> Selected Move:	1081	3	2	8	21900


> New Y[]: 
	
	 0  3  0  0  1  2  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,215

## ITERATION 103 #######################


> Neighbours evaluated; 27
> Selected Move:	1059	3	8	3	21400


> New Y[]: 
	
	 0  3  0  1  1  2  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,22

## ITERATION 104 #######################


> Neighbours evaluated; 27
> Selected Move:	1012	3	5	9	21400


> New Y[]: 
	
	 0  3  0  1  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  0  1  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 105 #######################


> Neighbours evaluated; 31
> Selected Move:	1005	3	3	5	21400


> New Y[]: 
	
	 0  3  0  0  1  1  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  1  0  0 
 > pw :0,23

## ITERATION 106 #######################


> Neighbours evaluated; 27
> Selected Move:	883	4	9	5	21900


> New Y[]: 
	
	 0  3  0  0  1  2  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  1  0  0 
 > pw :0,235

## ITERATION 107 #######################


> Neighbours evaluated; 24
> Selected Move:	968	3	5	3	21500


> New Y[]: 
	
	 0  3  0  2  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 108 #######################


> Neighbours evaluated; 29
> Selected Move:	800	3	9	2	20000


> New Y[]: 
	
	 0  3  1  2  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,245

## ITERATION 109 #######################


> Neighbours evaluated; 25
> Selected Move:	1025	3	7	5	21000


> New Y[]: 
	
	 0  3  1  2  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,25

## ITERATION 110 #######################


> Neighbours evaluated; 17
> Selected Move:	940	3	3	7	21600


> New Y[]: 
	
	 0  3  1  0  1  1  1  2  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,255

## ITERATION 111 #######################


> Neighbours evaluated; 18
> Selected Move:	958	4	7	6	21500


> New Y[]: 
	
	 0  3  1  0  1  1  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,26

## ITERATION 112 #######################


> Neighbours evaluated; 21
> Selected Move:	800	2	7	-1	16500


> New Y[]: 
	
	 0  3  1  0  1  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,265

## ITERATION 113 #######################


> Neighbours evaluated; 28
> Selected Move:	800	4	6	2	16100


> New Y[]: 
	
	 0  3  2  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,27

## ITERATION 114 #######################


> Neighbours evaluated; 26
> Selected Move:	800	4	2	4	17300


> New Y[]: 
	
	 0  3  1  0  2  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,275

## ITERATION 115 #######################


> Neighbours evaluated; 24
> Selected Move:	800	4	4	5	15400


> New Y[]: 
	
	 0  3  1  0  1  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,28

## ITERATION 116 #######################


> Neighbours evaluated; 26
> Selected Move:	878	1	-1	3	21400


> New Y[]: 
	
	 0  3  1  1  1  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,285

## ITERATION 117 #######################


> Neighbours evaluated; 15
> Selected Move:	739	3	3	8	21900


> New Y[]: 
	
	 0  3  1  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,29

## ITERATION 118 #######################


> Neighbours evaluated; 19
> Selected Move:	787	4	5	8	21700


> New Y[]: 
	
	 0  3  1  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,295

## ITERATION 119 #######################


> Neighbours evaluated; 19
> Selected Move:	814	3	5	7	20700


> New Y[]: 
	
	 0  3  1  0  1  0  1  1  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,3

## ITERATION 120 #######################


> Neighbours evaluated; 25
> Selected Move:	880	2	2	-1	15700


> New Y[]: 
	
	 0  3  0  0  1  0  1  1  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,305

## ITERATION 121 #######################


> Neighbours evaluated; 27
> Selected Move:	950	3	7	3	16700


> New Y[]: 
	
	 0  3  0  1  1  0  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,3

## ITERATION 122 #######################


> Neighbours evaluated; 27
> Selected Move:	950	4	8	3	16500


> New Y[]: 
	
	 0  3  0  2  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,295

## ITERATION 123 #######################


> Neighbours evaluated; 25
> Selected Move:	950	4	3	4	18800


> New Y[]: 
	
	 0  3  0  1  2  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,29

## ITERATION 124 #######################


> Neighbours evaluated; 24
> Selected Move:	950	4	4	6	18000


> New Y[]: 
	
	 0  3  0  1  1  0  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,285

## ITERATION 125 #######################


> Neighbours evaluated; 26
> Selected Move:	950	3	4	5	20000


> New Y[]: 
	
	 0  3  0  1  0  1  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  1  0  0  0 
 > pw :0,28

## ITERATION 126 #######################


> Neighbours evaluated; 21
> Selected Move:	950	4	6	3	18500


> New Y[]: 
	
	 0  3  0  2  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  1  0  0  0 
 > pw :0,275

## ITERATION 127 #######################


> Neighbours evaluated; 20
> Selected Move:	950	4	3	5	18900


> New Y[]: 
	
	 0  3  0  1  0  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  1  0  0  0 
 > pw :0,27

## ITERATION 128 #######################


> Neighbours evaluated; 22
> Selected Move:	950	4	5	8	18700


> New Y[]: 
	
	 0  3  0  1  0  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  1  1  0  0  0 
 > pw :0,265

## ITERATION 129 #######################


> Neighbours evaluated; 20
> Selected Move:	950	3	5	9	19200


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,26

## ITERATION 130 #######################


> Neighbours evaluated; 23
> Selected Move:	950	4	8	3	19000


> New Y[]: 
	
	 0  3  0  2  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,255

## ITERATION 131 #######################


> Neighbours evaluated; 22
> Selected Move:	950	4	3	9	18900


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,25

## ITERATION 132 #######################


> Neighbours evaluated; 23
> Selected Move:	950	3	9	0	17000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 133 #######################


> Neighbours evaluated; 27
> Selected Move:	950	3	1	4	18800


> New Y[]: 
	
	 2  0  0  1  3  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,24

## ITERATION 134 #######################


> Neighbours evaluated; 30
> Selected Move:	950	4	4	3	17400


> New Y[]: 
	
	 2  0  0  3  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,235

## ITERATION 135 #######################


> Neighbours evaluated; 30
> Selected Move:	950	4	3	6	18600


> New Y[]: 
	
	 2  0  0  1  1  0  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,23

## ITERATION 136 #######################


> Neighbours evaluated; 29
> Selected Move:	950	4	6	8	16800


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,225

## ITERATION 137 #######################


> Neighbours evaluated; 29
> Selected Move:	950	3	0	5	18700


> New Y[]: 
	
	 0  0  0  1  1  2  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,22

## ITERATION 138 #######################


> Neighbours evaluated; 20
> Selected Move:	950	4	5	3	18300


> New Y[]: 
	
	 0  0  0  2  1  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,215

## ITERATION 139 #######################


> Neighbours evaluated; 19
> Selected Move:	950	4	3	6	19800


> New Y[]: 
	
	 0  0  0  1  1  1  2  0  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,21

## ITERATION 140 #######################


> Neighbours evaluated; 18
> Selected Move:	950	3	6	0	18300


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,205

## ITERATION 141 #######################


> Neighbours evaluated; 29
> Selected Move:	976	1	-1	6	22800


> New Y[]: 
	
	 2  0  0  1  1  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,2

## ITERATION 142 #######################


> Neighbours evaluated; 21
> Selected Move:	1120	3	3	7	21800


> New Y[]: 
	
	 2  0  0  0  1  1  1  1  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,195

## ITERATION 143 #######################


> Neighbours evaluated; 30
> Selected Move:	1106	3	8	9	21100


> New Y[]: 
	
	 2  0  0  0  1  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  1  0  0 
 > pw :0,19

## ITERATION 144 #######################


> Neighbours evaluated; 32
> Selected Move:	1111	3	5	3	21100


> New Y[]: 
	
	 2  0  0  1  1  0  1  1  0  3 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 145 #######################


> Neighbours evaluated; 32
> Selected Move:	1009	3	9	5	21900


> New Y[]: 
	
	 2  0  0  1  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,19

## ITERATION 146 #######################


> Neighbours evaluated; 28
> Selected Move:	1169	3	3	2	20900


> New Y[]: 
	
	 2  0  1  0  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,195

## ITERATION 147 #######################


> Neighbours evaluated; 23
> Selected Move:	1145	4	5	7	21000


> New Y[]: 
	
	 2  0  1  0  1  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,2

## ITERATION 148 #######################


> Neighbours evaluated; 26
> Selected Move:	980	4	7	2	21800


> New Y[]: 
	
	 2  0  3  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,205

## ITERATION 149 #######################


> Neighbours evaluated; 21
> Selected Move:	971	3	2	3	21900


> New Y[]: 
	
	 2  0  0  3  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,21

## ITERATION 150 #######################


> Neighbours evaluated; 27
> Selected Move:	940	4	3	7	22000


> New Y[]: 
	
	 2  0  0  1  1  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,215

## ITERATION 151 #######################


> Neighbours evaluated; 27
> Selected Move:	943	3	3	8	22500


> New Y[]: 
	
	 2  0  0  0  1  1  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,22

## ITERATION 152 #######################


> Neighbours evaluated; 26
> Selected Move:	952	4	7	5	22400


> New Y[]: 
	
	 2  0  0  0  1  3  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,225

## ITERATION 153 #######################


> Neighbours evaluated; 25
> Selected Move:	880	4	0	6	19400


> New Y[]: 
	
	 0  0  0  0  1  3  2  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,23

## ITERATION 154 #######################


> Neighbours evaluated; 24
> Selected Move:	880	4	5	6	19500


> New Y[]: 
	
	 0  0  0  0  1  2  3  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,235

## ITERATION 155 #######################


> Neighbours evaluated; 21
> Selected Move:	880	4	5	8	19300


> New Y[]: 
	
	 0  0  0  0  1  1  3  1  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,24

## ITERATION 156 #######################


> Neighbours evaluated; 22
> Selected Move:	880	4	6	4	19500


> New Y[]: 
	
	 0  0  0  0  3  1  1  1  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,245

## ITERATION 157 #######################


> Neighbours evaluated; 23
> Selected Move:	880	4	4	5	18100


> New Y[]: 
	
	 0  0  0  0  1  3  1  1  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,25

## ITERATION 158 #######################


> Neighbours evaluated; 19
> Selected Move:	950	3	7	3	19100


> New Y[]: 
	
	 0  0  0  1  1  3  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,245

## ITERATION 159 #######################


> Neighbours evaluated; 15
> Selected Move:	950	4	5	3	19100


> New Y[]: 
	
	 0  0  0  3  1  1  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,24

## ITERATION 160 #######################


> Neighbours evaluated; 15
> Selected Move:	950	4	8	5	19300


> New Y[]: 
	
	 0  0  0  3  1  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,235

## ITERATION 161 #######################


> Neighbours evaluated; 16
> Selected Move:	950	4	3	5	18900


> New Y[]: 
	
	 0  0  0  2  1  3  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,23

## ITERATION 162 #######################


> Neighbours evaluated; 15
> Selected Move:	927	4	5	6	20100


> New Y[]: 
	
	 0  0  0  2  1  1  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,225

## ITERATION 163 #######################


> Neighbours evaluated; 16
> Selected Move:	883	4	3	8	20300


> New Y[]: 
	
	 0  0  0  1  1  1  3  0  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  1  0  0  0 
 > pw :0,22

## ITERATION 164 #######################


> Neighbours evaluated; 13
> Selected Move:	950	3	6	1	18200


> New Y[]: 
	
	 0  3  0  1  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,215

## ITERATION 165 #######################


> Neighbours evaluated; 23
> Selected Move:	970	1	-1	6	22700


> New Y[]: 
	
	 0  3  0  1  1  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,21

## ITERATION 166 #######################


> Neighbours evaluated; 19
> Selected Move:	941	4	8	5	22900


> New Y[]: 
	
	 0  3  0  1  1  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,205

## ITERATION 167 #######################


> Neighbours evaluated; 19
> Selected Move:	950	2	6	-1	18400


> New Y[]: 
	
	 0  3  0  1  1  2  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,2

## ITERATION 168 #######################


> Neighbours evaluated; 23
> Selected Move:	950	3	5	0	16500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,195

## ITERATION 169 #######################


> Neighbours evaluated; 28
> Selected Move:	950	3	1	5	18900


> New Y[]: 
	
	 2  0  0  1  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,19

## ITERATION 170 #######################


> Neighbours evaluated; 28
> Selected Move:	950	4	5	3	18900


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,185

## ITERATION 171 #######################


> Neighbours evaluated; 27
> Selected Move:	950	3	4	6	19400


> New Y[]: 
	
	 2  0  0  3  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  1  0  0  0 
 > pw :0,18

## ITERATION 172 #######################


> Neighbours evaluated; 26
> Selected Move:	950	4	3	5	19400


> New Y[]: 
	
	 2  0  0  1  0  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  1  0  0  0 
 > pw :0,175

## ITERATION 173 #######################


> Neighbours evaluated; 25
> Selected Move:	955	1	-1	4	23400


> New Y[]: 
	
	 2  0  0  1  1  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,17

## ITERATION 174 #######################


> Neighbours evaluated; 22
> Selected Move:	972	4	5	3	23400


> New Y[]: 
	
	 2  0  0  3  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,165

## ITERATION 175 #######################


> Neighbours evaluated; 23
> Selected Move:	957	3	8	2	21900


> New Y[]: 
	
	 2  0  1  3  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,16

## ITERATION 176 #######################


> Neighbours evaluated; 22
> Selected Move:	992	3	3	8	21800


> New Y[]: 
	
	 2  0  1  0  1  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,155

## ITERATION 177 #######################


> Neighbours evaluated; 27
> Selected Move:	908	4	8	5	22400


> New Y[]: 
	
	 2  0  1  0  1  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,16

## ITERATION 178 #######################


> Neighbours evaluated; 28
> Selected Move:	966	3	8	3	21900


> New Y[]: 
	
	 2  0  1  1  1  3  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,165

## ITERATION 179 #######################


> Neighbours evaluated; 22
> Selected Move:	808	4	5	2	22800


> New Y[]: 
	
	 2  0  3  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,17

## ITERATION 180 #######################


> Neighbours evaluated; 17
> Selected Move:	963	3	2	9	22100


> New Y[]: 
	
	 2  0  0  1  1  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 181 #######################


> Neighbours evaluated; 27
> Selected Move:	865	3	6	7	22600


> New Y[]: 
	
	 2  0  0  1  1  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  1  0  1  0  0  0  0 
 > pw :0,18

## ITERATION 182 #######################


> Neighbours evaluated; 30
> Selected Move:	802	3	4	6	23100


> New Y[]: 
	
	 2  0  0  1  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,185

## ITERATION 183 #######################


> Neighbours evaluated; 26
> Selected Move:	952	3	3	2	22100


> New Y[]: 
	
	 2  0  1  0  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,19

## ITERATION 184 #######################


> Neighbours evaluated; 27
> Selected Move:	903	3	9	4	22300


> New Y[]: 
	
	 2  0  1  0  3  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,195

## ITERATION 185 #######################


> Neighbours evaluated; 22
> Selected Move:	931	4	4	6	22100


> New Y[]: 
	
	 2  0  1  0  1  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,2

## ITERATION 186 #######################


> Neighbours evaluated; 23
> Selected Move:	800	2	7	-1	17100


> New Y[]: 
	
	 2  0  1  0  1  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,205

## ITERATION 187 #######################


> Neighbours evaluated; 28
> Selected Move:	800	4	6	2	16800


> New Y[]: 
	
	 2  0  3  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,21

## ITERATION 188 #######################


> Neighbours evaluated; 25
> Selected Move:	800	4	2	4	17300


> New Y[]: 
	
	 2  0  1  0  3  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,215

## ITERATION 189 #######################


> Neighbours evaluated; 26
> Selected Move:	800	4	4	5	15900


> New Y[]: 
	
	 2  0  1  0  1  3  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,22

## ITERATION 190 #######################


> Neighbours evaluated; 24
> Selected Move:	820	3	5	1	13500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,225

## ITERATION 191 #######################


> Neighbours evaluated; 28
> Selected Move:	820	3	4	9	16000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,22

## ITERATION 192 #######################


> Neighbours evaluated; 30
> Selected Move:	800	3	0	5	17900


> New Y[]: 
	
	 0  3  1  0  0  2  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,215

## ITERATION 193 #######################


> Neighbours evaluated; 23
> Selected Move:	800	4	5	2	18600


> New Y[]: 
	
	 0  3  2  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,21

## ITERATION 194 #######################


> Neighbours evaluated; 22
> Selected Move:	800	4	2	6	19000


> New Y[]: 
	
	 0  3  1  0  0  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,205

## ITERATION 195 #######################


> Neighbours evaluated; 18
> Selected Move:	978	3	2	8	20500


> New Y[]: 
	
	 0  3  0  0  0  1  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,2

## ITERATION 196 #######################


> Neighbours evaluated; 23
> Selected Move:	880	3	5	7	19500


> New Y[]: 
	
	 0  3  0  0  0  0  2  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,195

## ITERATION 197 #######################


> Neighbours evaluated; 29
> Selected Move:	880	4	6	7	19600


> New Y[]: 
	
	 0  3  0  0  0  0  1  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,19

## ITERATION 198 #######################


> Neighbours evaluated; 26
> Selected Move:	880	4	7	8	18200


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,185

## ITERATION 199 #######################


> Neighbours evaluated; 27
> Selected Move:	880	4	8	9	17900


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,18

## ITERATION 200 #######################


> Neighbours evaluated; 29
> Selected Move:	880	3	6	5	19400


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,175

## ITERATION 201 #######################


> Neighbours evaluated; 31
> Selected Move:	880	4	9	5	19900


> New Y[]: 
	
	 0  3  0  0  0  2  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,17

## ITERATION 202 #######################


> Neighbours evaluated; 27
> Selected Move:	880	4	5	8	19700


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,165

## ITERATION 203 #######################


> Neighbours evaluated; 27
> Selected Move:	880	3	9	4	17200


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,16

## ITERATION 204 #######################


> Neighbours evaluated; 27
> Selected Move:	880	4	8	4	19300


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,155

## ITERATION 205 #######################


> Neighbours evaluated; 30
> Selected Move:	904	3	7	3	20300


> New Y[]: 
	
	 0  3  0  1  2  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,15
________________________________________________________________

Best solution found: 1530
Run Termination time: 31.01.2010 10:22:57
Run duration: 00:00:41.3125000
________________________________________________________________
